Computational Topology Group Theory Afra

نویسنده

  • Afra Zomorodian
چکیده

Last lecture, we learned about a combinatorial method for characterizing spaces: using simplicial complexes as triangulations of the spaces. We also showed how the connectivity of compact 2-manifolds is fully characterized by an invariant, the Euler characteristic, that may be computed using any triangulation of the space. In this lecture, we study group theory. This theory is part of the beautiful machinery of abstract algebra, which is based on abstracting from algebra its core properties, and studying algebra in terms of those properties. Because of this abstraction, group theory is fundamental and applicable to questions in many theoretical fields such as quantum physics and crystallography, as well as questions in practical fields, such as establishing bar codes for products, serial numbers on currency, or solving Rubik’s Magic cube. For us, the theory provides powerful tools to define equivalence relations using homomorphisms and factor groups. These equivalence relations will enable us to partition the space of manifolds into coarser classifications that are computable. We begin with an introduction to groups, their subgroups, and associated cosets. We then look at how we factor a group much like the way we divide a composite integer. We end by developing techniques for characterizing a specific type of groups: finitely generated abelian groups.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Topological Data Analysis

Scientific data is often in the form of a finite set of noisy points, sampled from an unknown space, and embedded in a high-dimensional space. Topological data analysis focuses on recovering the topology of the sampled space. In this chapter, we look at methods for constructing combinatorial representations of point sets, as well as theories and algorithms for effective computation of robust to...

متن کامل

Cs 468 – Winter 2004 Simplicial Complexes Afra Zomorodian 3.1 Geometric Definition

In the first lecture, we looked at concepts from point set topology, the branch of topology that studies continuity from an analytical point of view. This view does not have a computational nature: we cannot represent infinite point sets or their associated infinite open sets on a computer. Starting with this lecture, we will look at concepts from another major branch of topology: combinatorial...

متن کامل

Computational Topology Surface Topology Afra

Last lecture, we spent a considerable amount of effort defining manifolds. We like manifolds because they are locally Euclidean. So, even though it is hard for us to reason about them globally, we know what to do in small neighborhoods. It turns out that this ability is all we really need. This is rather fortunate, because we suddenly have spaces with more interesting structure than the Euclide...

متن کامل

Computational Topology Simplicial Complexes

In the first lecture, we looked at concepts from point set topology, the branch of topology that studies continuity from an analytical point of view. This view does not have a computational nature: we cannot represent infinite point sets or their associated infinite open sets on a computer. Starting with this lecture, we will look at concepts from another major branch of topology: combinatorial...

متن کامل

Computational Topology 5.1 Homotopy

In Lecture 4, we learned about an algebraic method for describing and classifying structures. In this lecture, we look at using algebra to find combinatorial descriptions of topological spaces. We begin by looking at an equivalence relation called homotopy that gives a classification of spaces that is coarser that homeomorphism, but respects the finer classification. That is, two spaces that ha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007